Convex Hulls of Random Point Sets

Abstract: The convex hull of a point set is the smallest convex polytope containing the point set. Convex hulls of random points in Euclidean space arise naturally in a wide variety of disciplines, including optimization, computational geometry, statistics, economics, and ethology. This talk will survey old and new results describing statistics of the convex hull on large data sets. We shall also discuss more recent results concerning the fluctuations and the scaling limit of the convex hull boundary. This talk is based on joint work with Pierre Calka.

probability

Audience: advanced learners

Bangalore Probability Seminar

Series comments: The link to zoom meeting can be found on the seminar's google calendar - www.isibang.ac.in/~d.yogesh/BPS.html